On the Computational Asymmetry of the S-boxes Present in Blue Midnight Wish Cryptographic Hash Function
نویسندگان
چکیده
Blue Midnight Wish hash function is one of 14 candidate functions that are continuing in the Second Round of the SHA-3 competition. In its design it has several S-boxes (bijective components) that transform 32-bit or 64-bit values. Although they look similar to the S-boxes in SHA-2, they are also different. It is well known fact that the design principles of SHA-2 family of hash functions are still kept as a classified NSA information. However, in the open literature there have been several attempts to analyze those design principles. In this paper first we give an observation on the properties of SHA-2 S-boxes and then we investigate the same properties in Blue Midnight Wish.
منابع مشابه
On Blue Midnight Wish Decomposition
Blue Midnight Wish is one of the 14 candidates in the second round of the NIST SHA-3 competition [1]. In this paper we present a decomposition of the Blue Midnight Wish core functions, what gives deeper look at the Blue Midnight Wish family of hash functions and a tool for their cryptanalysis. We used this decomposition for better understanding the insights of Blue Midnight Wish functions and t...
متن کاملA Note on Linear Approximations of BLUE MIDNIGHT WISH Cryptographic Hash Function
BLUE MIDNIGHT WISH hash function is the fastest among 14 algorithms in the second round of SHA-3 competition [1]. At the beginning of this round authors were invited to add some tweaks before September 15th 2009. In this paper we discuss the tweaked version (BMW). The BMW algorithm [3] is of the type AXR, since it uses only operations ADD (sub), XOR and ROT (shift). If we substitute the operati...
متن کاملWhy narrow-pipe cryptographic hash functions are not a match to wide-pipe cryptographic hash functions?
In the last 7-8 months me and Klima have discovered several deficiencies of narrow-pipe cryptographic hash designs. It all started with a note to the hash-forum list that narrow-pipe hash functions are giving outputs that are pretty different than the output that we would expect from a random oracle that is mapping messages of arbitrary length to hash values of n-bits. Then together with Klima ...
متن کاملSingle Core Implementation of Blue Midnight Wish Hash Function on VIRTEX 5 Platform
This paper presents the design and analysis of an area efficient implementation of the SHA-3 candidate Blue Midnight Wish hash function with different digest sizes of 256 and 512 bits on an FPGA platform. The core functionality with finalization implementation without padding stage of BMW on Xilinx Virtex-5 FPGA requires 51 slices for BMW256 and 105 slices for BMW-512. Both BMW versions require...
متن کاملHardware Implementation of the Compression Function for Selected SHA-3 Candidates
Hardware implementation of the main building block (compression function) for five different SHA-3 candidates is presented. The five candidates, namely Blue Midnight Wish, Luffa, Skein, Shabal, and Blake have been considered since they present faster software implementation results compared to the rest of the SHA-3 proposals. The compression functions realized in hardware create the message dig...
متن کامل